Reconciling Data Compression and Kolmogorov Complexity
نویسندگان
چکیده
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor, for short, has to map a word to a unique code for this word in one shot, whereas with the standard notions of Kolmogorov complexity a word has many different codes and the minimum code for a given word cannot be found effectively. This gap is bridged by introducing decidable Turing machines and a corresponding notion of Kolmogorov complexity, where compressors and suitably normalized decidable machines are essentially the same concept. Kolmogorov complexity defined via decidable machines yields characterizations in terms of the intial segment complexity of sequences of the concepts of Martin-Löf randomness, Schnorr randomness, Kurtz randomness, and computable dimension. These results can also be reformulated in terms of time-bounded Kolmogorov complexity. Other applications of decidable machines are presented, such as a simplified proof of the Miller-Yu theorem (characterizing Martin-Löf randomness by the plain complexity of the initial segments) and a new characterization of computably traceable sequences via a natural lowness notion for decidable machines.
منابع مشابه
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypotheses testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are suggested. AMS subject classification: 60G10, 62M07, 68Q30, 68W01, 94A29.
متن کاملSymbol Compression Ratio for String Compression and Estimation of Kolmogorov Complexity
A new compression algorithm is derived that computes and encodes the Minimum Message Length (MML) near optimal partition of symbols in a string for compression. Using Symbol Compression Ratio (SCR) as a driving function this algorithm produces a binary tree model of the data that introduces a fundamental parameter of information related to Kolmogorov Complexity – the size of the alphabet in the...
متن کاملEvaluating Computer Animation Models with Lossy Data Compression Using Kolmogorov Complexity
متن کامل
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are described. AMS subject classification: 60G10, 62M07, 68Q30, 68W01, 94A29.
متن کاملAlgorithmic Rate-Distortion Theory
We propose and develop rate-distortion theory in the Kolmogorov complexity setting. This gives the ultimate limits of lossy compression of individual data objects, taking all effective regularities of the data into account.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007